Additive Number Theory and Inequalities in Ehrhart Theory

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kneser’s Theorem and Inequalities in Ehrhart Theory

We demonstrate how additive number theory can be used to produce new classes of inequalities in Ehrhart theory. More specifically, we use a classical result of Kneser to produce new inequalities between the coefficients of the Ehrhart δ-vector of a lattice polytope. The inequalities are indexed by the vertices of rational polyhedra Q(r, s) ⊆ R for 0 ≤ r ≤ s. As an application, we deduce all pos...

متن کامل

Ergodic Theory and Applications to Additive Number Theory

The following lemma follows the standard paradigm of recurrence results in ergodic theory: given a topological space X which satisfies a suitable ’smallness’ condition (e.g. compactness, μ(X) < ∞), and a transformation T : X → X, there exist points of X which satisfy a certain ’almost-periodicity’ condition under the action of T . Lemma 1. Poincare Recurrence Lemma If (X,β, μ, T ) is an m.p.s. ...

متن کامل

Some Problems in Additive Number Theory

(3) f(x) = (log x/log 2) + 0(1)? 1\Mloser and I asked : Is it true that f(2 11) >_ k+2 for sufficiently large k? Conway and Guy showed that the answer is affirmative (unpublished) . P. Erdös, Problems and results in additive number theory, Colloque, Théorie des Nombres, Bruxelles 1955, p . 137 . 2. Let 1 < a 1< . . . < ak <_ x be a sequence of integers so that all the sums ai,+ . . .+ais, i 1 <...

متن کامل

Fourier Analytic Methods in Additive Number Theory

In recent years, analytic methods have become prominent in additive number theory. In particular, finite Fourier analysis is well-suited to solve some problems that are too difficult for purely combinatorial techniques. Among these is Szemerédi’s Theorem, a statement regarding the density of integral sets and the existence of arithmetic progressions in those sets. In this thesis, we give a gene...

متن کامل

An asymptotic formula in additive number theory

1 . Introduction . In his paper [1], Erdös introduced the sequences of positive integers b 1 < b, < . . ., with (b ;, bj ) = 1, for i ~A j, and 'bi 1 < oo . With any such arbitrary sequence of integers, he associated the sequence {di} of all positive integers not divisible by any bj , and he showed that if b1 > 2, there exists a 0 < 1 (independent of the sequence {b i }) such that d i 1 di < d°...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Mathematics Research Notices

سال: 2015

ISSN: 1073-7928,1687-0247

DOI: 10.1093/imrn/rnv186